Numerical Differentiation of Noisy, Nonsmooth Data

نویسنده

  • Rick Chartrand
چکیده

In many scientific applications, it is necessary to compute the derivative of functions specified by data. Conventional finite-difference approximations will greatly amplify any noise present in the data. Denoising the data before or after differentiating does not generally give satisfactory results see an example in Section 4 . A method which does give good results is to regularize the differentiation process itself. This guarantees that the computed derivative will have some degree of regularity, to an extent that is often under control by adjusting parameters. A common framework for this is Tikhonov regularization 1 of the corresponding inverse problem. That is, the derivative of a function f , say on 0, L , is the minimizer of the functional

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Two-Stage Method for Inverse Acoustic Medium Scattering

We present a novel numerical method to the time-harmonic inverse medium scattering problem of recovering the refractive index from noisy near-field scattered data. The approach consists of two stages, one pruning step of detecting the scatterer support, and one resolution enhancing step with nonsmooth mixed regularization. The first step is strictly direct and of sampling type, and it faithfull...

متن کامل

Numerical Differentiation of Approximated Functions with Limited Order-of-Accuracy Deterioration

We consider the problem of numerical differentiation of a function f from approximate or noisy values of f on a discrete set of points; such discrete approximate data may result from a numerical calculation (such as a finite element or finite difference solution of a partial differential equation), from experimental measurements, or, generally, from an estimate of some sort. In some such cases ...

متن کامل

Algorithmic Differentiation for Piecewise Smooth Functions: A Case Study for Robust Optimization

This paper presents a minimization method for Lipschitz continuous, piecewise smooth objective functions based on algorithmic differentiation (AD). We assume that all nondifferentiabilities are caused by abs(), min(), and max(). The optimization method generates successively piecewise linearizations in abs-normal form and solves these local subproblems by exploiting the resulting kink structure...

متن کامل

Fractional Order Numerical Differentiation with B-spline Functions

Smoothing noisy data with spline functions is well known in approximation theory. Smoothing splines have been used to deal with the problem of numerical differentiation. In this paper, we extend this method to estimate the fractional derivatives of a smooth signal from its discrete noisy data. We begin with finding a smoothing spline by solving the Tikhonov regularization problem. Then, we prop...

متن کامل

Benson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality

‎In this paper‎, ‎we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints‎. ‎We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions‎. ‎We also fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005